Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U. Platform: |
Size: 4853791 |
Author:陈宝文 |
Hits:
Description: C#实现的最短路径AStar算法,是我见过最好的AStar算法。-c# shortest path AStar calculation, It is the best calculation I ve ever seen Platform: |
Size: 65536 |
Author:杨波 |
Hits:
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U. Platform: |
Size: 4853760 |
Author:陈宝文 |
Hits:
Description: [实验目的]
1. 熟悉图的存储结构
2. 掌握图的最短路径算法
[实验内容]
用无向网表示学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度等信息。要求能够回答有关景点介绍、游览路径等问题。
[实验要求]
1 查询各景点的相关信息；
2 查询图中任意两个景点间的最短路径。
3 查询图中任意两个景点间的所有路径。
-[Experimental purposes] 1. Familiar with the storage structure of Figure 2. To master plan the shortest path algorithm [experimental content] free to the net means that schools Attractions plan, map, said the main attractions vertex, store the number of spots, names, profile, etc. information, the figure that the attraction between the edges of roads, storage of information such as path length. Asked to answer questions about attractions, the tour path and so on. [Experiment] 1 query the various scenic spots in the relevant information 2 query graph between any two spots of the shortest path. 3 query graph between any two spots of all the paths. Platform: |
Size: 4096 |
Author:王建媚 |
Hits:
Description: Bellman-Ford Shortest Path Algorithm
(C) 2004 by Yu Hen Hu
find shortest path from a fixed point U to any node V
clear all
n=input( Total number of nodes = )
echo on
starting from a fixed point U, you enter the weight to each
node as the weight on the edge from U to that node V
if there is no such edge, enter inf
when enter a vector, put all number within brackets [ ]
echo o-Bellman-Ford Shortest Path Algorithm
(C) 2004 by Yu Hen Hu
find shortest path from a fixed point U to any node V
clear all
n=input( Total number of nodes = )
echo on
starting from a fixed point U, you enter the weight to each
node as the weight on the edge from U to that node V
if there is no such edge, enter inf
when enter a vector, put all number within brackets [ ]
echo off Platform: |
Size: 1024 |
Author:vahid |
Hits:
Description: dijkstra.zip，用于实现dijkstra的最短路径矩阵的构建，也能求出每个店的最短路径矩阵-dijkstra.zip, the shortest path to achieve dijkstra used to construct the matrix. Platform: |
Size: 1024 |
Author:涂洋 |
Hits:
Description: graf.zip - software for visualization of graphs (without source).Shortest path problem is one of the most important classical problems of graph theory. Today we know a lot of algorithms to solve. Platform: |
Size: 366592 |
Author:valerapori |
Hits:
Description: dijkstra算法，解决两点间最短路的问题(Dijkstra algorithm to solve the problem of the shortest path between two points) Platform: |
Size: 34816 |
Author:miracleo
|
Hits:
Search - shortest path.zip